Finite State Machine Binary Entropy Coding
نویسندگان
چکیده
A method of universal binary entropy coding using simple state machines is presented. We provide a natural rationale for the use of state machines. We discuss the building of state machines which produce uniquely decodable bit streams. Some state machines implement known codes, while others implement finite or even infinite variable length to variable length codes. Once a decodable state machine is found, it is adjusted for maximum compression. Compression results are given for both single context and multiple context coding. All state machines presented have a bounded required lookahead to decode each binary decision. In addition, the machines presented can easily provide joint source channel coding for constrained (e.g., run length limited) channels.
منابع مشابه
Universal Finite Memory Coding of Binary Sequences
This work considers the problem of universal coding of binary sequences, where the universal encoder has limited memory. Universal coding refers to a situation where a single, universal, encoder can achieve the optimal performance for a large class of models or data sequences, without knowing the model in advance, and without tuning the encoder to the data. In the previous work on universal cod...
متن کاملLookahead Search for Lossy Context-Based Adaptive Entropy Coding
In this paper we motivate the need for lookahead search in a context based entropy coder. An efficient algorithm based on modeling of the context coder as a finite state machine is presented. A key contribution of this paper is the use of the per survivor processing principle (PSP) to enable a lookahead search in scenarios where adaptive entropy coding is used. Our results show that lookahead s...
متن کاملComplexity Analysis of Adaptive Binary Arithmetic Coding Software Implementations
This paper is dedicated to the complexity comparison of adaptive binary arithmetic coding integer software implementations. Firstly, for binary memoryless sources with known probability distribution, we prove that encoding time for arithmetic encoder is a linear function of a number of input binary symbols and source entropy. Secondly, we show that the byte-oriented renormalization allows to de...
متن کاملCoding theorems for individual sequences
A quantity called the finite-state complexity is assigned to every infinite sequence of elements drawn from a finite set. This quantity characterizes the largest compression ratio that can be achieved in accurate transmission of the sequence by any finite-state encoder (and decoder). Coding theorems and converses are derived for an individual sequence without any probabilistic characterization,...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کامل